Formal Specification and Validation of Selective Acknowledgement Protocol using Z/EVES Theorem Prover
نویسندگان
چکیده
منابع مشابه
Logical Ontology Validation Using an Automatic Theorem Prover
Ontologies are utilized for a wide range of tasks, like information retrieval/extraction or text generation, and in a multitude of domains, such as biology, medicine or business and commerce. To be actually usable in such real-world scenarios, ontologies usually have to encompass a large number of factual statements. However, with increasing size, it becomes very difficult to ensure their compl...
متن کاملUsing the Theorem Prover
This paper describes experiments with the automated theorem prover SETHEO. The prover is applied to proof tasks which arise during formal design and speciication in Focus. These proof tasks originate from the formal development of a communication protocol (Stenning protocol). Its development and veriication in Focus is described in \C. Dendorfer, R. Weber: Development and Implementation of a Co...
متن کاملWeb Service Choreography Verification Using Z Formal Specification
Web Service Choreography Description Language (WS-CDL) describes and orchestrates the services interactions among multiple participants. WS-CDL verification is essential since the interactions would lead to mismatches. Existing works verify the messages ordering, the flow of messages, and the expected results from collaborations. In this paper, we present a Z specification of WS-CDL. Besides ve...
متن کاملFormal Specification and Validation of Security Policies
We propose a formal framework for the specification and validation of security policies. To model a secured system, the evolution of security information in the system is described by transitions triggered by authorization requests and the policy is given by a set of rules describing the way the corresponding decisions are taken. Policy rules are constrained rewrite rules whose constraints are ...
متن کاملHow to Avoid the Formal Verification of a Theorem Prover
The purpose of this papers to show a technique to automatically certify answers coming from a nontrustable theorem prover. As an extreme consequence, the development of non-sound theorem provers has been considered and investigated, in order to evaluate their relative efficiency on particular classes of difficult theorems. The presentation will consider as a case study, a tableau-based theorem ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Sciences
سال: 2006
ISSN: 1812-5654
DOI: 10.3923/jas.2006.1712.1719